Systems and methods for authenticating and protecting the integrity of data streams and other data

ABSTRACT

Systems and methods are disclosed for enabling a recipient of a cryptographically-signed electronic communication to verify the authenticity of the communication on-the-fly using a signed chain of check values, the chain being constructed from the original content of the communication, and each check value in the chain being at least partially dependent on the signed root of the chain and a portion of the communication. Fault tolerance can be provided by including error-check values in the communication that enable a decoding device to maintain the chain&#39;s security in the face of communication errors. In one embodiment, systems and methods are provided for enabling secure quasi-random access to a content file by constructing a hierarchy of hash values from the file, the hierarchy deriving its security in a manner similar to that used by the above-described chain. The hierarchy culminates with a signed hash that can be used to verify the integrity of other hash values in the hierarchy, and these other hash values can, in turn, be used to efficiently verify the authenticity of arbitrary portions of the content file.

RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.15/188,737, filed on Jun. 21, 2016, now allowed, which is a continuationof U.S. patent application Ser. No. 14/304,422, filed on Jun. 13, 2014,now U.S. Pat. No. 9,401,896, which is a continuation of U.S. patentapplication Ser. No. 13/018,274, filed on Jan. 31, 2011, now U.S. Pat.No. 8,762,711, which is a continuation of U.S. patent application Ser.No. 12/038,664, filed on Feb. 27, 2008, now U.S. Pat. No. 7,882,351,which is a continuation of U.S. patent application Ser. No. 11/112,520,filed on Apr. 22, 2005, now U.S. Pat. No. 7,340,602, which is acontinuation of U.S. application Ser. No. 09/543,750, filed on Apr. 5,2000, now U.S. Pat. No. 6,959,384, which claims the benefit of U.S.Provisional Application No. 60/170,828, filed on Dec. 14, 1999, and isrelated to commonly-assigned U.S. Provisional Application No.60/138,171, filed on Jun. 8, 1999, and commonly-assigned U.S. patentapplication Ser. No. 09/276,233, filed on Mar. 25, 1999, now U.S. Pat.No. 7,233,948, all of which are hereby incorporated by reference intheir entireties.

COPYRIGHT AUTHORIZATION

A portion of the disclosure of this document contains material that issubject to copyright protection. The copyright owner has no objection tothe facsimile reproduction of the patent document or the patentdisclosure as it appears in the Patent and Trademark Office files orrecords, but otherwise reserves all copyrights whatsoever.

FIELD OF THE INVENTION

The present invention relates generally to the communication and storageof electronic data. More specifically, the present invention relates tosystems and methods for authenticating and protecting the integrity ofelectronic information using cryptographic techniques.

BACKGROUND OF THE INVENTION

As electronic commerce grows in popularity, there is an increasing needfor systems and methods that protect the rights and interests of theparties involved. One class of problems faced by those conductingtransactions remotely via electronic communications networks such as theInternet is that of authenticating messages received from others andproviding ways for others to authenticate one's own messages. Forexample, a party to an electronic transaction will typically wantassurance that the other parties are who they purport to be. A partywill also want to prevent attackers from misappropriating its identityby, e.g., forging its signature or otherwise assuming its identity ininteractions with others. A related problem is that of verifying theintegrity of an electronic communication—that is, verifying that thecontent of the communication has not been modified—when, due totransmission errors, malicious tampering, or a variety of other factors,this may not be the case.

A variety of authentication and validation schemes have been proposed,ranging from the use of passwords to the use of cryptographicsignatures. In general, these schemes rely on the existence of a secretshared between the parties to a transaction. By demonstrating knowledgeof the shared secret, the parties are able to authenticate themselves toone another. Many cryptographic signature schemes are based on publickey cryptography. In public key cryptography, a party creates asignature by applying a strong cryptographic hash algorithm (e.g.,SHA-1) to a plaintext message and encrypting the result with the party'sprivate key. The signature message is often as big as the private keymodulus, which is typically much larger than the output from the hashalgorithm. To verify the signature, a recipient needs to obtain the fullmessage, hash it, decrypt the signature using the signer's public key,and compare the decrypted signature with the hash of the message. If thecomputed hash is equal to the decrypted signature, then the message isdeemed to be authentic.

FIGS. 1A and 1B illustrate the conventional signature generation anddetection process described above. Referring to FIG. 1A, a hashingalgorithm 102 is applied to a plaintext message 100 to yield a hash ormessage digest 104. A signature 105 is generated by encrypting messagedigest 104 using an encryption algorithm 106 and the sender's privatekey 108. Signature 105 is then transmitted to the recipient along with acopy of message 100. Although, for ease of explanation, FIG. 1A showsmessage 100 being sent to the recipient in unencrypted form, message 100could be sent in encrypted form instead, if it were desired to maintainthe confidentiality of the message.

Referring to FIG. 1B, the recipient of a message 100′ and a signature105′ applies hash function 114 to message 100′ to yield message digest116. The recipient also decrypts signature 105′ using the sender'spublic key 118 to yield message digest 120. Message digest 116 is thencompared with message digest 120. If the two message digests are equal,the recipient can be confident (within the security bounds of thesignature scheme) that message 100′ is authentic, as any change anattacker made to message 100′ or signature 105′ would cause thecomparison to fail.

A problem with the approach shown in FIGS. 1A and 1B is that therecipient must receive the entire message 100′ before checking itsauthenticity. The recipient will thus need enough storage to hold theentire message, and must be willing to wait however long is needed toreceive it. It is often impractical to meet these limitations. Forexample, audio, video, and multimedia files are often relatively large,and can thus take a long time to download. In addition, many consumerelectronic devices for playing audio, video, or multimedia files haveminimal storage and/or processing capacity. As a result, systemdesigners will often wish to allow a consumer to begin using a filebefore it is completely downloaded, and/or without requiring theconsumer's system to store or process the entire file at one time. Thus,for example, multimedia files comprised of multiple MPEG frames aretypically designed to be processed on-the-fly by the consumer's device,each MPEG frame being processed while the next frame is received. Thisis commonly known as “streaming.”

One way to adapt the traditional signature scheme described above foruse with streaming applications is to break message 100 into subparts,and to sign each subpart separately. However, this approach has severaldrawbacks. For example, it can require a relatively large amount ofprocessing power, since both the signature issuer and the signatureverifier need to perform numerous relatively-costly public and/orprivate key operations. In addition, this approach is relatively costlyin terms of bandwidth and/or storage requirements, as inserting a largenumber of cryptographic signatures into the stream can noticeablyincrease the stream's size. Yet another drawback of this approach isthat it fragments the signed message into a set of unrelated, signedsub-messages. This can be less secure and more inconvenient than workingwith a single, atomic document, as it can be difficult, for example, todetermine whether the sub-messages have been received in the correctorder. Thus, there is a need for systems and methods that overcome someor all of these limitations by providing relatively fast, secure, andefficient authentication of data streams and other electronic content.

SUMMARY OF THE INVENTION

The present invention provides systems and methods for securelyverifying and protecting the integrity of electronic data streams andother types of electronic data. It should be appreciated that thepresent invention can be implemented in numerous ways, including as aprocess, an apparatus, a system, a device, a method, or a computerreadable medium such as a computer readable storage medium or a computernetwork wherein program instructions are sent over optical or electroniccommunication lines. Several inventive embodiments of the presentinvention are described below.

In one embodiment, a method is disclosed for encoding a digital file ina manner designed to facilitate authentication of a streamedtransmission of the file. In accordance with this embodiment, aprogression of check values is generated, each check value in theprogression being derived from a hashed portion of the file and from atleast one other check value in the progression. A file is encoded byinserting each check value into the file in proximity to the portion ofthe file to which it corresponds. The encoded file is then transmittedto a user's system where it can be authenticated on-the-fly using thecheck values.

In another embodiment, a computer program product is disclosed forencoding data in a manner designed to facilitate authentication of astreamed data transmission. The computer program product preferablyincludes computer code for generating a progression of check values,each check value being derived, at least in part, from at least oneother check value in the progression and from a hash of a portion of thedata. Computer code is also provided for inserting each check value intothe data in proximity to the portion of data to which it corresponds.Additional computer code is operable to send a streamed transmission ofthe encoded data to a user's system, where it is authenticatedon-the-fly using the check values. The computer codes are contained on acomputer readable medium such as a CD-ROM, DVD, MINIDISC, floppy disk,magnetic tape drive, flash memory chip, ROM, RAM, system memory, harddrive, optical storage, and/or a data signal embodied in a carrier wave.

In yet another embodiment, a computer program product is provided forverifying the integrity of a block of data. The computer program productpreferably includes computer code for receiving a first portion of theblock of data, and for receiving first and second check values in achain of check values, each check value in the chain being derived froma corresponding portion of the block of data and from at least one othercheck value in the chain. Computer code is provided for using the firstcheck value to verify the integrity of the first portion of the block ofdata and of the second check value. Computer code is also provided forallowing use of the first portion of the block of data if its integrityis successfully verified.

In another preferred embodiment, a system for performing fault-tolerantauthentication of a stream of data is provided. The system includes areceiver for receiving sub-blocks of the stream, error-check valuescorresponding to the sub-blocks, and verification values in a chain ofverification values associated with the stream, each verification valuebeing derived from a sub-block of the stream and at least one otherverification value in the chain. The system also includeserror-detection logic operable to use the received error-check values todetect errors in corresponding sub-blocks of the stream. Error-handlinglogic is also provided, the error-handling logic being operable torecord the detection of errors by the error-detection logic, and toblock the receipt of additional sub-blocks if a predefined errorcondition is satisfied. The system also includes authentication logic,the authentication logic being operable to use the received verificationvalues to verify the integrity of data sub-blocks, other verificationvalues, and error-check values in the stream.

In yet another embodiment, a method for authenticating a block of datais disclosed. The method includes receiving a first sub-block of theblock of data, a first error-check value, a first check value, and asecond check value, wherein the first check value and the second checkvalue form part of a progression of check values associated with theblock of data, each check value in the progression being derived, atleast in part, from a sub-block of the block of data and at least oneother check value in the progression. In accordance with this method,the first error-check value is used to detect corruption of the firstsub-block. Upon detecting corruption, the first check value and thefirst error-check value are used to verify the integrity of the secondcheck value.

In another embodiment of the present invention, a method is disclosedfor encoding a block of data in a manner designed to facilitatefault-tolerant authentication. In accordance with this method, aprogression of check values is generated, each check value in theprogression being derived from a portion of the block of data and fromat least one other check value in the progression. The block of data isencoded by inserting the check values and error check values into theblock in proximity to the portions of the block to which theycorrespond. The error-check values can be used to detect errors in theblocks of data, and, if errors are found, can be used to helpauthenticate the check values in the progression. The encoded block ofdata is transmitted to a user's system, the user's system being operableto receive and authenticate portions of the encoded block of data beforethe entire block is received.

In another preferred embodiment, a method is disclosed for encoding adigital file in a manner designed to facilitate secure quasi-randomaccess to the file. In accordance with this method, a multi-levelhierarchy of hash values is generated from the digital file, where thehash values on a first level of the hierarchy are at least partiallyderived from the hash values on a second level of the hierarchy. A roothash value is digitally signed, the root hash value being derived fromeach of the hash values in the hierarchy. The signed root hash value andat least a portion of the rest of the hierarchy are stored on a computerreadable medium for use in verifying the integrity of the digital file.

In another preferred embodiment, a method for securely accessing a datablock is disclosed. The method includes selecting a portion of the datablock and retrieving from storage a corresponding root verificationvalue and one or more check values in a hierarchy of check values,wherein the hierarchy of check values is derived, at least in part, froman uncorrupted version of the data block. The root verification value isused to verify the integrity of the other check values. A calculatedcheck value is obtained by hashing a first sub-block of the data block,the first sub-block including at least part of the selected portion ofthe data block. The calculated check value is compared with anappropriate one of the stored check values, and at least part of theselected portion of the data block is released for use if the calculatedcheck value equals the stored check value.

In yet another preferred embodiment, a system for providing secureaccess to a data file is provided. The system preferably includes amemory unit for storing a digital signature and a plurality of hashvalues related to the data file, the digital signature and the pluralityof hash values forming a hierarchy. The system includes a processingunit, logic for decrypting the digital signature to obtain a rootverification value, hash verification logic for using the rootverification value to verify the integrity of one or more hash values inthe hierarchy, and logic for selecting a portion of the data file foruse. A hashing engine is provided for calculating a hash of a datasub-block, the data sub-block including at least part of a selectedportion of the data file. A first comparator is used to compare the hashof the data sub-block with a verified hash value in the hierarchy.Control logic is operable to release the data sub-block for use if thecalculated hash equals the previously-verified hash.

These and other features and advantages of the present invention will bepresented in more detail in the following detailed description and theaccompanying figures which illustrate by way of example the principlesof the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will be readily understood by the followingdetailed description in conjunction with the accompanying drawings,wherein like reference numerals designate like structural elements, andin which:

FIGS. 1A and 1B illustrate a conventional digital signature verificationtechnique.

FIGS. 2A and 2B illustrate systems for practicing an embodiment of thepresent invention.

FIG. 3 is a flow chart illustrating a data encoding process inaccordance with an embodiment of the present invention.

FIG. 4 is a block diagram illustrating the flow of data in an encodingprocess in accordance with an embodiment of the present invention.

FIG. 5 is a flow chart illustrating an authentication process inaccordance with an embodiment of the present invention.

FIG. 6 is a block diagram illustrating the flow of data in anauthentication process in accordance with an embodiment of the presentinvention.

FIG. 7 is a flow chart illustrating an error recovery process inaccordance with an embodiment of the present invention.

FIG. 8 is a block diagram illustrating an error recovery process inaccordance with an embodiment of the present invention.

FIG. 9 is a flow chart of a method for processing a block of data in amanner designed to facilitate secure content navigation.

FIGS. 10A, 10B, and 100 illustrate an encoding scheme designed tofacilitate secure content navigation in accordance with an embodiment ofthe present invention.

FIG. 11 is a flow chart of a method for accessing a content file inaccordance with an embodiment of the present invention.

FIG. 12 illustrates an authentication tree in accordance with oneembodiment of the present invention.

FIGS. 13A, 13B, 13C, and 13D illustrate a memory management techniquefor use in conjunction with the secure content navigation methods of thepresent invention.

FIG. 14 is a data flow diagram illustrating a method for verifying theintegrity of the hash values in a tree of hash values in accordance withan embodiment of the present invention.

FIGS. 15A and 15B are flow charts of methods for authenticating blocksof data in accordance with embodiments of the present invention.

DETAILED DESCRIPTION

A detailed description of the present invention is provided below. Whilethe invention is described in conjunction with several embodiments, itshould be understood that the invention is not limited to any oneembodiment. On the contrary, the scope of the invention is limited onlyby the appended claims, and the invention encompasses numerousalternatives, modifications and equivalents. For example, while severalembodiments are described in the context of a system and method forviewing or playing video, audio, or multimedia data, those skilled inthe art will recognize that the disclosed systems and methods arereadily adaptable for broader application. For example, withoutlimitation, the present invention could be readily applied to the securetransmission and use of computer software or virtually any other type ofinformation (hereinafter referred to collectively as “data,” unlessotherwise noted). In addition, while numerous specific details are setforth in the following description in order to provide a thoroughunderstanding of the present invention, the present invention can bepracticed according to the claims without some or all of these details.Finally, for the purpose of clarity, certain technical material that isknown in the art related to the invention has not been described indetail in order to avoid unnecessarily obscuring the present invention.

Systems and methods are disclosed for enabling the recipient of acryptographically-signed electronic communication to verify theauthenticity of the communication on-the-fly, thus obviating the need toreceive and store the entire communication before verifying itssignature and releasing it to the end user. The systems and methodsdisclosed herein are believed to be as secure as conventional signatureschemes which do not support on-the-fly signature verification.Moreover, the efficiency of the disclosed systems and methods comparesfavorably with the efficiency of conventional techniques in terms ofprocessing time and memory usage. Thus, the present inventionadvantageously provides systems and methods for reducing the bandwidth,storage, and/or processing requirements of secure communicationssystems.

FIG. 2A illustrates a system for practicing an embodiment of the presentinvention. As shown in FIG. 2A, an encoding system 202, such as ageneral-purpose computer, is used to encode data and to transmit it to arecipient's system 204 (shown in FIG. 2B), which could be anothercomputer, a television set-top box, a portable audio or video player, orany other suitable system.

As shown in FIG. 2A, encoding system 202 preferably includes:

-   -   a processing unit 216;    -   system memory 218, preferably including both high speed random        access memory (RAM) and non-volatile memory, such as read only        memory (ROM), erasable or alterable non-volatile memory (e.g.,        flash memory), and/or a hard disk, for storing system control        programs, data, cryptographic keys, application programs, and        the like;    -   one or more input/output devices, including, for example:        -   network interface 210 for communicating with other systems            via a network 203 such as the Internet;        -   I/O port 212 for connecting to, e.g., a portable device,            another computer, or other peripheral devices; and        -   one or more disk drives 214 for reading from, and/or writing            to, e.g., diskettes, compact discs, DVDs, SONY® MINIDISC™            audio discs, produced by Sony Corporation of Tokyo, Japan            and New York, N.Y., and/or other computer readable media;    -   a user interface 226, including a display 228 and one or more        input devices, such as keyboard 206 and mouse 208; and    -   one or more internal buses 240 for interconnecting the        aforementioned elements of the system.

The operation of system 202 is controlled primarily by programscontained in system memory 218 and executed by the system's processingunit 216. These programs preferably include modules for accepting inputdata and for processing the input data in accordance with the techniquesdescribed herein. For example, system 202 preferably includes modulesfor generating hash values, digital signatures, and other metadatarelating to the input data, and also preferably includes modules forstoring and/or transmitting some or all of the metadata and input data.One of ordinary skill in the art will appreciate, however, that some orall of the functionality of these modules could be readily implementedin hardware without departing from the principles of the presentinvention.

Referring now to FIG. 2B, a system 204 is shown for decoding andauthenticating data that have been encoded by a system such as system202. As previously described, system 204 may consist of a personalcomputer system, a portable audio or video player, a television set-topbox, a telephone, a personal digital assistant, or any other suitabledevice. Recipient's system 204 is operable to receive, decode, andauthenticate data, and to release authenticated data for viewing,listening, execution (in the case of software), or other uses. Data canbe delivered to system 204 in a variety of ways, including via networkinterface 275, I/O port 256, a disc or diskette 280 inserted into drive258, or by the physical installation of, e.g., a flash memory chip.

As shown in FIG. 2B, in one embodiment system 204 preferably includes:

-   -   a processing unit 244;    -   system memory 246, preferably including a combination of RAM        248, ROM 250, and non-volatile memory 251 (such as flash memory        or a magnetic disk) for storing system control programs, data,        and application programs, including programs such as input        verification logic 284 for performing the techniques described        herein;    -   one or more input/output devices, including, for example:        -   network interface 275 for communicating with other systems            via network 203;        -   I/O port 256 for connecting to, e.g., a portable device or            another computer;        -   one or more disk drives 258 for reading data and/or programs            from, e.g., diskettes, compact discs, DVDs, and/or MINIDISC™            audio discs; and/or        -   a speaker system 273;    -   a user interface 260, including a display 262 and one more input        devices such as control panel 264; and    -   one or more internal buses 274 for interconnecting the        aforementioned elements of the system.

As described in more detail below, input verification logic 284 is usedto verify the authenticity of streaming data 296 received from network203 via network interface 275, and/or to verify the authenticity of datacontained in system memory 246, on disk 280, or on other storage media.Input verification logic 284 preferably includes signature verificationlogic 285 for unsigning signed data, and a hashing engine 286 forperforming hashing operations. Although in one embodiment inputverification logic 284 is implemented in firmware stored in ROM 250 andexecuted by processor 244, one skilled in the art will appreciate thatinput verification logic 284 could alternatively be implemented usingoptional circuitry 270, programs 272 stored in RAM 248, or any othersuitable combination of firmware, circuitry, and/or applicationprograms.

In yet another embodiment, input verification logic 284 is implementedin a special protected processing environment (PPE) 288, such as a chipor a tamper-resistant software module. As shown in FIG. 2B, protectedprocessing environment 288 preferably includes non-volatile memory 289,volatile memory 290, a processor 291, a tamper-resistant barrier 293,and a communications port 294 for communicating with other components ofsystem 204. Use of a protected processing environment can beadvantageous, in that it provides an area that is protected fromunauthorized observation or modification in which to store cryptographickeys and to perform cryptographic operations. Additional information onexemplary implementations of a protected processing environment can befound in Ginter, et. al “Systems and Methods for Secure TransactionManagement and Electronic Rights Protection,” U.S. Pat. No. 5,892,900,issued on Apr. 6, 1999, which is hereby incorporated by reference. Itshould be understood, however, that the present invention can be readilyimplemented using systems and methods that do not include or rely onsuch a protected processing environment.

The structure and operation of encoding and decoding systems 202 and 204will now be described in more detail with reference to FIGS. 3-15.Encoding system 202 is operable to generate a chain or progression ofverification values, each verification value in the chain beingpartially derived from the verification values that precede it. FIGS. 3and 4 illustrate a technique for generating such a chain. The processshown in FIG. 3 is repeated for each sub-block P_(i) of a data file(300), starting with the last sub-block of the file. As shown in FIG. 3,a hash is calculated for each sub-block P_(i) (302). In a preferredembodiment a hashing algorithm such as SHA-1 is used; however, one ofordinary skill in the art will appreciate that any suitable hashing orcombination function could be used, including the secure hashingfunctions described in B. Schneier, Applied Cryptography, 2d ed. (Wiley,1996), pages 429-512 of which are hereby incorporated by reference. Thehash of each sub-block is combined with the hash of the previousverification or check value in the chain (304), and the resulting checkvalue, H(C_(i)), is saved for later use and/or transmission (306). Inone embodiment, H(C_(i)) is created by (a) concatenating the hash ofP_(i) with the previously-generated check value H(C_(i+1)), and (b)hashing the result; however, it will be appreciated that othercombination techniques can be used instead without departing from theprinciples of the present invention. H(C_(i)) then becomes the “previouscheck value” for the next iteration (308), and the entire process(302-309) is repeated for the next sub-block. After each sub-block hasbeen processed, the last check/verification value (corresponding to thefirst sub-block in the file, P₁) is signed using a suitable signature oridentification scheme (310), such as RSA, DSA, Diffie-Hellmanencryption, an elliptic curve-based algorithm, or a suitable one of thetechniques described in B. Schneier, Applied Cryptography 2d ed. atpages 483-512.

FIG. 4 is a data flow diagram of an illustrative implementation of theencoding process shown in FIG. 3. Referring to FIG. 4, a block of data400 is shown that includes n sub-blocks (e.g., 402, 410, 418, 425,etc.). For purposes of performing the operations shown in FIGS. 3 and 4,data block 400, or at least a portion of it, is preferably loaded intosystem memory 218 of encoding device 202. Data 400 may, for example,consist of an audio file compressed using the MP3 format, the WINDOWS®Media Audio format developed by Microsoft Corporation of Redmond, Wash.,or any other suitable format. Data 400 may additionally (oralternatively) include video, textual, or multimedia information, acomputer program or applet, or any other type of data or executable.

In FIG. 4, data block 400 is processed from right to left (i.e., fromthe back of the data block to the front). First, the hash of the lastsub-block, P_(n) 402, is calculated. The result of this hashingoperation, H(P_(n)) 404, is combined with a predefined pattern 406, andthe combination 407 is hashed to yield check value H(C_(n)) 408. Pattern406 may, for example, consist of a block the same size as H(P_(n)) 404containing alternating 1's and 0's, a single repeating number, such as 0or 10 hexadecimal (i.e., 0xA), or any other suitable set of values. Inone embodiment, H(P_(n)) 404 and pattern 406 are simply concatenated;however, it will be appreciated that a more complex combination functioncould be used instead. Alternatively, combination block 405 can beeffectively eliminated by feeding H(P_(n)) 404 and pattern 406 directlyinto the module or circuitry 409 that performs the hashing operation.

The next sub-block, P_(n−1) 410, of data block 400 is processed in asimilar manner. Specifically, the hash of sub-block P_(n−1) 410 iscalculated, and the result, H(P_(n−1)) 412, is combined with H(C_(n))408. The combination of H(P_(n−1)) 412 and H(C_(n)) 408 is hashed toyield H(C_(n−1)) 414, which is used in the processing of the nextsub-block, P_(n−2) 418. As discussed previously, a separate combinationstep can be eliminated by simply feeding H(P_(n−1)) 412 and H(C_(n)) 408directly into hashing module or circuitry 415. In addition, one ofordinary skill in the art will appreciate that in practice, encodingsystem 202 may include only one hash module, as opposed to a separatehash module or circuit for each sub-block (e.g., 408, 415, etc.), asshown in FIG. 4 to facilitate explanation. In such an embodiment, dataflow through the hash module or circuit is controlled by system programsand/or clocking circuitry.

The process described in the preceding paragraph is repeated for eachsub-block, P_(i), of file 400, and the last check value, H(C₁) 422, issigned by, e.g., encrypting it with the encoder's private key 423 toyield signed block S(H(C₁)) 424. Thus, after one complete processingpass over data block 400, encoding system 202 generates a check value,H(C_(i)), for each sub-block, P_(i), and a digital signature for atleast the final sub-block, P₁ 425. These hash values and the signatureare stored in memory 218.

To transfer data block 400 to a recipient 204, encoding system 202 firstsends S(H(C₁)) 424, the sub-block to which S(H(C₁)) 424 corresponds(i.e., P₁ 425), and check value H(C₂) 421. Encoding system 202 thencontinues to send successive sub-blocks, P_(i), and check values,H(C_(i+1))—moving left to right in FIG. 4—until the entire file has beentransmitted. If it is desired to keep file 400 secret duringtransmission, the sub-blocks, P_(i), and optionally the check values,H(C_(i)), can be encrypted before they are sent; however, this is notnecessary for purposes of practicing the present invention.

The structure and operation of the decoding logic used by recipient 204when receiving a file will now be described with reference to FIGS. 5and 6. FIG. 5 is a flow chart of a technique for decoding andauthenticating data in accordance with an embodiment of the presentinvention. As shown in FIG. 5, recipient 204 first obtains the signedcheck value, S(H(C₁))′, for the first sub-block of the file (502), andunsigns it using, e.g., the encoder's public key (504), which ispreferably stored in recipient's ROM 250/289 or in another non-volatilememory store. The unsigned value, H(C₁)′, can then be used to verify theauthenticity of the next sub-block of data that is received (506). (Notethat the “prime” notation used throughout the Detailed Description andDrawings denotes data that have undergone, e.g., a transmission orpossible transformation that may have altered the data from theiroriginal form; for example, “P_(i)” represents an original sub-block,while “P_(i)′” represents that sub-block—or a sub-block purporting to beP_(i)—after transmission to, e.g., recipient 204).

As each sub-block P_(i) in the file is received (508), the hash of thesub-block is calculated using the same hashing function used by encodingsystem 202 in block 302 of FIG. 3 (510). The hash of the sub-block isthen combined with the next verification value that is received (i.e.,H(C_(i+1))), and the hash of the combination is computed (512). Thetechnique used to form the combination in block 512 is the same orequivalent to the technique used by encoder 202 in block 304 of FIG. 3.Next, the calculated check value H(C_(i)′) is compared with the checkvalue that was received, H(C_(i))′ (514), which in the case of the firstsub-block, P₁, is the unsigned value H(C₁)′ obtained in block 504.

If the two values are equal, then sub-block P_(i) and check valueH(C_(i+1)) are deemed to be authentic, and the sub-block can be releasedfor use (518). The check value is then updated (520), and the entireprocess (508-522) is repeated for the next sub-block and check valuethat are received.

However, if comparison block 514 indicates that H(C_(i)′) is not equalto H(C_(i))′, then P_(i) is judged to be unauthentic, as an inequalityat block 514 indicates that P_(i) and/or H(C_(i+1)) were modified afterbeing processed by encoding system 202. Upon detecting such a condition,decoding system 204 is preferably operable to take appropriate defensiveaction 516. For example, decoding system 204 can terminate theconnection with the source of the data, prevent the user from makingfurther use of the data, display a warning or error message on display262, shut itself down, shut down the application that was receiving orusing the file, or simply record the occurrence of this condition forlater reporting or action. Although decoding system 204 could optionallycontinue playing or making use of the file even after an inequality wasdetected at block 514, the file would no longer be authenticated withthe security of the digital signature, thus making it possible for aclever attacker to mount an attack at relatively little cost comparedwith that of cracking the signature.

FIG. 6 is a data flow diagram of an illustrative implementation of theprocess shown in FIG. 5. Referring to FIG. 6, a stream of data 600 isshown that could be received from, e.g., network interface 275, inputport 256, or disk drive 258. As sub-blocks of data stream 600 arereceived (from left to right in FIG. 6) they are processed in the mannerdescribed in connection with FIG. 5. If additional sub-blocks arereceived while other, previously-received sub-blocks are still beingprocessed, buffer 259 can be used to temporarily store the incoming datauntil the decoding system is ready to process them.

Referring to FIG. 6, when the first signed check value S(H(C₁))′ 602 isreceived, it is unsigned using, e.g., the encoder's public key 604. Theunsigned check value, H(C₁)′ 605, is stored in system memory 246/290 foruse in verifying the authenticity of the first sub-block, P₁′ 606,contained in data stream 600. When sub-block P₁′ 606 is received, it ishashed using the same hashing function that the encoder used in block302 of FIG. 3. The result of this hashing operation, H(P₁′) 608, iscombined with the next check value in the stream, i.e., H(C₂)′ 610, andthe hash of this combination, H(C₁′) 612, is calculated. As described inconnection with block 512 of FIG. 5, the technique used to formcombination 611 is the same or equivalent to the technique used in block304 of FIG. 3.

Next, comparison block 607 compares H(C₁′) 612 with check value H(C₁)′605. If these two values are equal, then the decoding system can besatisfied that P₁′ 606 and H(C₂)′ 610 are authentic (i.e., that they areequal to P₁ 425 and H(C₂) 421, respectively, from encoding system 202).Decoding system 204 then releases content P₁′ 606 for use by the system,saves H(C₂)′ 610 for later use in authenticating the next block of data,F₂′ 616, and continues the process of receiving and authenticatingsuccessive blocks in stream 600. If, on the other hand, comparison 607fails, decoding system 204 can terminate further receipt of data stream600 and/or take other defensive action.

The next sub-block, F₂′ 616, of stream 600 is processed in asubstantially similar manner. Specifically, the hash of sub-block F₂′616 is calculated, and the result, H(P₂′) 618, is combined with H(C₃)′620. The combination of H(P₂′) 618 and H(C₃)′ 620 is hashed to yieldH(C₂′) 622. H(C₂′) 622 is compared with H(C₂)′ 610, which wasauthenticated in connection with the authentication of P₁′ 606, asdescribed in the preceding paragraph. If the comparison indicates thatthe two values are equal, then P₂′ 616 and H(C₃)′ 620 are deemed to beauthentic; otherwise, appropriate defensive measures are taken.

The basic process set forth in the preceding paragraph is repeated foreach sub-block, P_(i)′, of stream 600, as shown in FIG. 6. Thus, thetechniques shown in FIGS. 5 and 6 are operable to detect attempts by anattacker to tamper with data 400 or the check values used to verify thatdata's authenticity.

As shown in FIG. 4, the check values, H(C_(i)), and the hashedsub-blocks, H(P_(i)), are effectively interlocked, forming a chain orprogression whose root is signed to yield signature 424. Signature 424is thus partially derived from each of the check values (or links) andsub-blocks of the file 400. Because the authenticity determination foreach sub-block thus depends, at least in part, on the signature value,this scheme is believed to be as secure as the conventional techniquedescribed previously in connection with FIGS. 1A and 1B. Yet unlike theconventional scheme, it is able to preserve the unity of the signeddocument and does not require that the entire document be received orstored in memory before its authenticity can be verified. Although themethod shown in FIGS. 3-6 introduces some processing and space overhead,it is preferable to the alternative of signing each sub-blockseparately, since there is only one public key operation, the hashoperations are relatively cheap, and the size of each hash is typicallymuch smaller than the size of a full cryptographic signature (e.g., by afactor of 10). It will be appreciated that the methods and structuresset forth in FIGS. 3-6 illustrate one embodiment of the presentinvention, and that modifications can be made to these methods andstructures without departing from the principles of the presentinvention.

Another problem that arises in the authentication of data streams andother data files is that of errors introduced by the communicationsystem and/or storage media. For example, burst errors can occur in anetwork communication due to electromagnetic interference, faultyconnections, and/or lost or delayed packets of data. Similarly, datastored on, and retrieved from, computer readable media can suffer frombit errors due to defective storage cells or read/write errors, andthese errors can cause data to be lost or misinterpreted.

Although such errors are often benign, in that they may not evidence amalicious intent to tamper with the system, they can neverthelessinterfere with attempts to securely authenticate data communications, asbit errors in either the plaintext message, the check values, or theencrypted signature will typically cause authentication to fail. Yet iftransmission of a file is simply aborted each time a portion of the filefails to verify, random bit errors may force a user attempting to accessa relatively large file to restart the transmission multiple timesbefore he or she is eventually able to obtain a perfect, verifiable copyof the file.

This result is especially undesirable, as errors resulting from theunreliability of storage and communications media are often too small tobe detected by users. Moreover, even when such errors are detectable,users will typically prefer to continue receiving the stream of content,rather than restart reception from the beginning. For example, in thecase of a user listening to a streamed audio report, the user willtypically wish to hear the entire report from start to finish, even ifbit errors add occasional noise, rather than have to restart the reporteach time an error is detected. In short, users will often be willing tosacrifice signal quality in order to avoid the alternative of restartingreception of the signal each time an error is detected, as restartingreception effectively eviscerates one of the primary benefits ofstreaming delivery—i.e., the ability to use data as it is beingdelivered, instead of having to wait until an entire file is received.Thus, there is a need for authentication schemes that exhibit faulttolerance.

The present invention solves the problem described above while requiringonly a small amount of additional data to be inserted into thetransmitted data stream, as shown in FIGS. 7 and 8. Specifically, in apreferred embodiment the hash, H(P_(i)), of each sub-block, P_(i), isalso packaged in the transmitted data stream. This can be done, forexample, between blocks 302 and 304 of the flow chart shown in FIG. 3.As described in more detail below, the additional hash values allowdetection of bit errors in P_(i) (and/or H(P_(i))) prior to, and/orindependent of, the detection of such errors by the authenticationprocess described in connection with FIGS. 5 and 6. In this way, if partof the content stream is corrupted, a correction can be made thatenables the verification of the rest of the stream to continue.

FIG. 7 is a flow chart of an illustrative embodiment of such anerror-recovery process. The process described in FIG. 7 can be insertedbetween blocks 510 and 512 of the authentication process shown in FIG.5. Referring to FIG. 7, when the decoding system receives a sub-block,P_(i)′, and its corresponding hash, H(P_(i))′, the decoding systemcomputes the hash of P_(i)′ as previously described in connection withFIG. 5 (i.e., block 510). The computed hash, H(P_(i)′), is then comparedwith the hash, H(P_(i))′, that was inserted into the data stream. If thehashes are equal, the signature verification scheme proceeds with theprocess shown in FIGS. 5 and 6. However, if the comparison fails (i.e.,a “no” exit from block 706), this provides evidence that sub-block P_(i)has been corrupted. When this occurs, the decoding system is operable touse the included hash H(P_(i))′ in place of the computed hash H(P_(i)′)in the subsequent authentication process (712), thus enabling theauthentication to succeed (provided, of course, that the included hashH(P_(i))′ has not been corrupted, too).

In a preferred embodiment, the detection of errors at block 706 isrecorded, so that the decoding system can detect unduly high levels ofsuch errors and take appropriate defensive action. For example, thesystem might simply sum the detected errors (708) and compare therunning total with a threshold or a threshold percentage (710).Alternatively, the pattern of detected errors between blocks can berecorded and analyzed, so that suspicious patterns can be detected(e.g., errors in more than a predefined number of consecutive blocks,errors at the same position in comparable groups of blocks, etc.), eventhough the gross amount or percentage of errors may not exceed a giventhreshold. It should be appreciated, however, that any suitable errorresponse could be used without departing from the principles of thepresent invention.

FIG. 8 is an illustration of how the data flow diagram shown in FIG. 6could be modified to incorporate the error-recovery process describedabove. As shown in FIG. 8, the primary modifications are the addition ofhash blocks 802 in the data stream, the addition of comparison blocks804, and the addition of appropriate logic 806 to handle the output ofthe comparison blocks. In a hardware implementation, for example, theoutput of comparator 804 could be used to select the appropriate one ofH(P_(i)′) and H(P_(i))′ using a multiplexer 806.

In one embodiment additional fault tolerance is provided by accountingfor errors that may occur in the included hash, H(P_(i))′ 802. Errors inH(P_(i))′ can lead to inappropriate rejection of the content, since ifH(P_(i)′) 803 is replaced by a corrupted H(P_(i))′ 802—i.e., a “no”output from comparison 706—comparison 808 can be expected to fail evenif block P_(i)′ has not been corrupted. Thus, in one embodiment ifH(P_(i)′) 803 is replaced by H(P_(i))′ 802 for a given block, and aninequality is later detected by comparison 808, blocks 810 and 812 areexecuted again using the computed hash H(P_(i)′) 803 instead of theincluded hash H(P_(i))′ 802. If comparison 808 then succeeds, therecipient can be confident that data P_(i)′ is authentic. Thus, thisembodiment prevents errors in the included hash from causing incorrectinvalidity assessments to be made about P_(i)′. It will be appreciatedhowever, that given the relative size differential between the includedhash value H(P_(i))′ and the data block P_(i)′ to which itcorresponds—typically on the order of 20 bytes for the hash versus 64 KBfor the block (or 0.03%)—correct handling of this relatively rarecondition may not, in a given application, be worth the extra cost itimposes in memory usage and/or chip-count.

Thus, the mechanism described above provides fault tolerance whileavoiding serious compromise to the security offered by theauthentication process. This would not be the case, for example, if acertain number of failed comparisons 514 were allowed in the processshown in FIG. 5, since any such failed comparison would break theconnection between the remaining portion of the hash chain and thesignature of the root—the chain's dependence on the signature (andvice-versa) being responsible for the bulk of the security offered bythis scheme.

Another problem facing signature-based authentication schemes is that ofproviding some degree of random access to the signed data in a mannerthat does not compromise the ability to detect unauthentic data. Forexample, a user may wish to access a track in the middle of a CD ordatabase without having to listen to each of the preceding tracks and/orwithout having to wait for each track to be authenticated. However, ifthe root signature is at the beginning of the CD or database, allowingaccess to a track in the middle, without first verifying theauthenticity of each intervening block of data and each block'scorresponding check value, would break the chain of trust connecting theintermediate track to the root signature.

In one embodiment secure content navigation and quasi-random access areenabled by constructing a tree of hash values, the tree deriving itssecurity in substantially the same manner as the hash chain describedabove in connection with FIGS. 3-8. The tree enables efficientauthentication of the content contained at an arbitrary, user-selectedlocation within a content file, and enables decoding/playing device 204to efficiently and dynamically authenticate successive blocks of contentstarting from the selected location. The construction and use of such atree is described below in connection with FIGS. 9-15.

FIG. 9 is a flow chart illustrating a process for encoding data in amanner designed to facilitate efficient and secure content navigation.As shown in FIGS. 9 and 10, the content provider preprocesses apredefined portion of content (e.g., a file or a track) by dividing it(logically or physically) into segments P_(i) (910), similar to themanner in which content was divided into sub-blocks in FIG. 4. The hashH(P_(i)) of each of these segments is computed (912), groups of thesehashes are combined (914), and the hash, H(G_(m,i)), of each of the newgroups is calculated (916) (where the subscript “m” denotes the mthlevel of the hash tree, and the subscript “i” denotes the ith group-hashof that level). As shown in FIG. 9, this process is repeated until asingle group hash, H(G_(1,1)), is obtained for the entire file(918-924). The final group hash is then signed (926), and the signatureand a predefined portion of the previously-calculated hash values arestored for later use in verifying the integrity of the content to whichthey correspond (928).

FIGS. 10A and 10B further illustrate the process described above.Referring to FIG. 10A, a content file 1005—e.g., a document, movie,audio track, etc. —is partitioned logically and/or physically into aplurality of segments, P_(i) 1010. In a preferred embodiment, segments1010 are of equal size; however, it will be appreciated that segments ofdifferent sizes could also be used. The hash of each segment 1010 istaken, yielding a plurality of hash values, H(P_(i)) 1012. Hash values1012 are partitioned into groups 1014 (again, either logically orphysically), and the hash of each such group, H(G_(n−1,i)) 1016, iscomputed. In the example shown in FIGS. 10A and 10B, groups of fourhashes 1012 are concatenated; however, it will be appreciated that anysuitable predefined number of hashes could be combined in any suitablemanner without departing from the principles of the present invention.In addition, although a symmetric tree structure is shown in FIGS. 10Aand 10B, one of ordinary skill in the art will appreciate that anysuitable data structure could be used, including without limitation ab-tree, a binary tree, a t-ary tree, an asymmetric tree, or a tree witha non-uniform branching factor.

As shown in FIG. 10B, the process of combining groups of hashes andhashing the result is repeated for each level of hashes 1024, andconcludes once a final top-level group hash, H(G_(1,1)) 1020, isobtained for the entire file 1005. Signature 1022 is formed by signingfinal group hash 1020. Thus, as shown in FIG. 100, a tree 1026 of hashor check values is generated, culminating in a signed check value 1022for the entire file 1005 or the relevant portion thereof. As describedabove, some or all of tree 1026 may be stored in, e.g., memory 218 ofencoding system 202, and/or transmitted to a user's system 204 via,e.g., network 203, disc 280, or I/O port 212 for use and/or storagealong with the content file 1005 to which it corresponds. It should beappreciated that the tree structure of the present invention is readilyscalable. Thus, for example, separate trees (with separate rootsignatures) can be provided for different subparts of a file (e.g.,separate tracks on an audio CD), or a single tree can be provided forthe entire file.

FIG. 11 is a flowchart illustrating a method by which a user can accesscontent that has been processed in the manner described above. Referringto FIG. 11, the user first obtains the content file and itscorresponding signature and hash tree (1102). For example, the user'ssystem 204 may receive these data from network 203 or a disc 280inserted into disc drive 258. When the user wishes to access aparticular portion of the content file (1104)—for example, a particulartrack on an audio CD, or a particular portion of a track—the relevantportion of the hash tree is loaded into memory 246 and/or secure memory290, and the integrity of the loaded hash values are verified (1108). Ina preferred embodiment, input verification engine 284 loads only thosegroups of hash values in the tree that are needed to verify theauthenticity of the first block of the requested portion of content;however, it will be appreciated that any suitable portion of the treecould be loaded in any suitable manner without departing from theprinciples of the present invention. For example, in one embodiment onlythe top two levels of hash values (i.e., levels 1 and 2 in FIG. 100) areretained in memory with the content file and loaded into secure memorywhen access to a portion of the content file is requested. And inanother embodiment, the entire hash tree is loaded into memory 290 andauthenticated.

If any of the loaded hash values fail to authenticate (i.e., a “Not OK”exit from block 1108), control passes to a verification failure handlerto take appropriate defensive action (1110). The verification failurehandler may, for example, simply display an error message to the userand terminate further access to the content. Or, in another embodiment,the verification error handler may re-compute the hash value(s) thatfailed to verify, using the appropriate portion of the stored contentfile. The recomputed hash values can then be combined, hashed, andcompared with the original signature. Such an approach can be useful ifthe hash values, but not the content or the signature, have beencorrupted. In other embodiments, other error handling techniques areused.

Referring once again to FIG. 11, after the hash tree (or the relevantportion thereof) has been authenticated (1108), access to the content isallowed to proceed (1112-1118). The integrity of the selected content isverified using the previously-authenticated hash values (1112). If thecontent is deemed to be authentic, it is released for use (e.g., sent tothe system's speakers, display screen, printer, etc.) (1116); otherwise,an error handling routine is called (1114). The process ofauthenticating and releasing content is repeated for each successiveblock of content in the file (1118) until either the end of the file isreached or the user selects a new location in the file, at which pointthe process shown in FIG. 11 is started once again.

FIGS. 12 and 13 illustrate one preferred implementation of theauthentication technique described in connection with FIG. 11. Referringto FIG. 12, a hash tree 1200 is shown that corresponds to content file1202, the content file being comprised of a plurality of blocks 1204.Hash tree 1200 could, for example, be constructed in the mannerdescribed above in connection with FIGS. 9 and 10. When a user wishes toaccess a particular portion of content, decoding system 204 preferablyloads the relevant branches of tree 1200 into a memory such as RAM 290of PPE 288. For example, if the user wishes to access content block 1204c, then, as shown in FIG. 12, root 1210, the four level-2 hashes 1212,four of the level-3 hashes 1214, and four of the level-4 hashes 1216 areloaded into memory 290 and authenticated.

FIGS. 13A, 13B, 13C, and 13D provide a more detailed illustration of apreferred technique for loading relevant portions of tree 1200 intomemory and for authenticating those tree portions along with the contentto which they correspond. As shown in FIG. 13A, in one preferredembodiment hash values from tree 1200 are stored in memory 290 in astack data structure 1302. FIGS. 13A-13D illustrate the state of stack1302 at various points during the authentication of a piece of content.As shown in FIG. 13A, if a user requests access to block 1204 a of FIG.12, the corresponding hash groups 1210, 1212, 1213, 1215 of tree 1200are pushed onto stack 1302. As each group of hashes is pushed onto thestack, it can be authenticated using the previously loaded andauthenticated hash values. For example, hashes 1212 can be authenticatedby hashing their combination and comparing that value with unsigned roothash 1210. Similarly, hashes 1213 are authenticated by hashing theircombination and comparing that value with the appropriatepreviously-loaded hash value (i.e., hash 1220), and hashes 1215 areauthenticated in a similar manner using hash 1218. Finally, therequested portion of content 1204 a is authenticated by computing itshash and comparing that value with hash 1222.

As successive portions of content are accessed (e.g., 1204 b, etc.),their hashes are computed and compared with the correspondingauthenticated hash values on the stack. As shown in FIGS. 13B, 13C, and13D, when additional portions of tree 1200 are needed, they can beloaded onto stack 1302 and authenticated, and previously-loaded portionsof tree 1200 that are no longer needed can be removed from the stack.For example, as shown in FIG. 13B, when decoding device 204 wishes toaccess block P1.2.1, hashes 1316 are loaded onto stack 1302 andauthenticated against previously-authenticated hash value 1324.

In a preferred embodiment, content blocks are loaded into, e.g., RAM 248or RAM 290 of the user's system 204 prior to authentication, and afterauthentication the blocks are released for use directly therefrom. Thisprocedure helps prevent an attacker from substituting unauthenticcontent for content that has been authenticated, e.g., by overwritingthe authenticated content in insecure memory. Thus, in a preferredembodiment the integrity of content is verified (or re-verified) eachtime it is retrieved from insecure memory for use.

The approach illustrated in FIGS. 12 and 13 can thus provide anefficient balance between the memory and processing requirements of theauthentication scheme. In particular, the amount of memory used by thisembodiment is about four hashes for each level of the tree (except forthe root). Thus, for example, an eight-level hash tree with a branchingfactor of four could be used to authenticate the content of a DVDcontaining 7.5 gigabytes of data, the data being divided into 15,000blocks of 500 kilobytes each. To access and authenticate any given blockusing the technique illustrated in FIGS. 12 and 13, the root hash andfour hash values from each of the other seven levels of the tree wouldbe loaded onto the stack. If a hash function is used that yields 20-bytehashes (e.g., SHA-1), it would only be necessary to have stack storagefor 7*4*20+20=580 bytes of hash data (possibly plus a small amount ofadditional indexing metadata).

In addition, real-time processing requirements can be reduced bypre-authenticating successive portions of the tree in a pipelinedfashion. For example, as shown in FIG. 13, the hash values 1328 neededto authenticate the next group of data blocks (and/or the data blocksthemselves) can be pre-loaded and authenticated before access to thosedata blocks is actually needed. In addition, in some applications it maybe desirable to authenticate the hash tree before access to any specificportion of the content is actually requested. Thus, for example,selected hash values and the signature can be loaded into memory when auser's system 204 is turned on, or when a specific application isinitiated. For instance, in one embodiment when a portable device isturned on, and/or when a CD is inserted into the portable device, theportable device automatically loads and verifies the hash values and thesignature(s) that correspond to the content that is deemed most likelyto be requested next (e.g., the first track of the CD, the content atthe location that was accessed most recently, etc.). In this regard,well-known caching techniques can be used to load and authenticate thehash values and/or tree(s) deemed most likely to be used next.

While FIGS. 12 and 13 illustrate an embodiment in which only those hashgroups needed to authenticate a given content block are loaded intosecure memory and authenticated, one of ordinary skill in the art willappreciate that a variety of other techniques could be used to implementthe hierarchical authentication scheme of the present invention. Forexample, in another embodiment, the entire hash tree is pre-loaded andauthenticated. In this embodiment, the process shown in FIG. 11 ismodified by moving blocks 1108 and 1110 so that they fall between blocks1104 and 1106 (i.e., placing them before the content authenticationloop). This technique may be useful in applications where system memoryis not a limiting factor, and/or in embodiments where a content file(e.g., a CD or DVD) is mapped onto a plurality of relatively small,authentication trees (e.g., one per track).

FIG. 14 illustrates a process for authenticating the hash values of atree in an embodiment in which the entire tree is loaded into memoryprior to content access. As shown in FIG. 14, level-one root hash 1404is obtained by unsigning signature 1402, and calculated root hash 1406is obtained by combining and hashing the level-two hashes 1408.Calculated hash 1406 is then compared with unsigned root hash 1404, andan error handler 1405 is called if the comparison is unsuccessful. Ifthe comparison is successful, then the stored level-two hashes 1408 aredeemed to be authentic.

Similarly, each group of level-three hashes 1412 is hashed to yield acalculated level-two hash 1410. Each calculated level-two hash 1410 iscompared with its corresponding, stored level-two hash 1408. If any suchcomparison fails, then the appropriate error handler is called;otherwise, the stored level-three hashes 1412 are deemed to beauthentic. As shown in FIG. 14, the verification process continues inthis manner until each level of stored hashes has been authenticated.

Once the hash tree has been verified (i.e., once the process shown inFIG. 14 has successfully concluded), the upper layers of the hash treecan be removed from secure memory 290, thereby advantageously conservingspace, which in many applications is of limited supply. For example, inone embodiment only the hash values 1012 at the lowest level (i.e., thenth level) of the tree are maintained in secure memory. Since the lowerhash values derive their security from having been checked against theroot signature (or values derived therefrom), compromise to security isavoided as long as the lower hash values are maintained in secure memoryafter they have been authenticated. Moreover, since the entire treepreferably remains stored in non-volatile memory 251, ROM 250, and/ordisc 280, some or all of the tree is available to be reloaded intosecure memory 290 and re-authenticated if the need arises.

The process of authenticating a block of content (e.g., block 1112 inFIG. 11) will now be described in more detail with reference to FIGS.15A and 15B. FIG. 15A illustrates the authentication process for anembodiment such as that shown in FIGS. 12 and 13 in which the hashesfrom the lowest level of the tree (i.e., the nth level) are stored insecure memory 290. As shown in FIG. 15A, a block of content isauthenticated by computing its hash (1502), and comparing it with thecorresponding hash stored in memory (1504). If the computed hash isequal to the stored (and previously authenticated) hash, then thecontent is deemed to be authentic; otherwise, appropriate defensivemeasures are taken (1505).

As previously discussed, any suitable defensive measure(s) could beused. For example, in one embodiment further access to the content (orat least the unauthentic block) is denied. Alternatively (or inaddition), an error handling routine could be called (1505) to determine(e.g., based on the frequency, number, or pattern of errors) whether topermit access to the block despite its failure to authenticate, orwhether to prevent or terminate access to the block instead. Forexample, if the block size is small enough that allowing a certain levelof unauthentic content to be used would not unduly compromise theinterests being protected by the authentication scheme, then allowinguse to proceed despite the detection of some errors may be desirable. Onthe other hand, if absolute integrity is required—e.g., as might be thecase with an important applet or other executable program, where singlebit errors could disrupt or modify the program's operation—then theerror handler will preferably prevent access to, or execution of, thefile if the authentication of any block fails.

FIG. 15B illustrates the process of authenticating a block of content inan embodiment in which the lowest level of the hash tree that is storedin memory 290 is the next-to-last level (i.e., the (n−1)st level). Asshown in FIG. 15B, in such an embodiment it will generally be necessaryto construct the lower portion of the hash tree, the root of which canbe compared to a hash from the lowest level stored in memory. Ingeneral, this process is quite similar to the process shown in FIG. 14for verifying the integrity of a hash tree. Thus, referring to FIG. 15B,when access to a particular piece of content is requested, a contentsegment that includes the beginning of the requested piece is firstloaded and partitioned (logically or physically) into blocks (1510). Thehash of each such block is computed (1512), the hashes are combined(1514), and the hash of the combination is computed (1516). The resultis compared with the appropriate (n−1)st level hash stored in memory(1518). If the computed hash is equal to the stored hash, then thecontent is deemed to be authentic; otherwise, appropriate defensivemeasures are taken (1519). One of ordinary skill in the art willappreciate that the process shown in FIG. 15B can be readily adapted toembodiments in which the hash values from a different level (e.g., the(n−2)nd level, etc.) of the hash tree are stored in memory.

As FIGS. 15A and 15B illustrate, the granularity of the random-accessverification scheme is effectively determined by the level of the hashvalues that are stored in memory. For example, if, as in FIG. 15A,hashes from the lowest level of the tree are authenticated and stored inmemory, then content can be authenticated directly on a block-by-blockbasis. If, on the other hand, the next-to-lowest level of hashes arestored in memory—as in FIG. 15B—then content is authenticated fourblocks at a time (i.e., by an amount of blocks equal to the branchingfactor used in the tree). In a limiting case, where only the rootsignature of the tree is stored in memory, the authenticationgranularity would be the size of the file itself.

Note, however, that the granularity of the authentication scheme neednot limit the granularity of the actual access that is allowed. Theauthentication granularity simply relates to the amount of computationthat is performed by the authentication scheme before content isreleased. For example, a portable device may allow the user to jump toan arbitrary point within a content file, irrespective of thegranularity of the authentication scheme; however, the granularity ofthe authentication scheme would dictate the amount of computation neededto authenticate the content before it was released.

Thus it can be seen that there will typically be some tradeoff betweenthe amount of computational resources and the amount of memory requiredby the authentication scheme. At one extreme, where only the root of thetree is maintained in memory, the memory requirements are relatively low(e.g., the size of a signature or hash), while the dynamic computationrequirements are relatively high, as the entire hash tree must becomputed dynamically before any given piece of content is released. Atthe other extreme (and in one preferred embodiment), dynamic computationrequirements are minimized by storing hashes from the lowest level ofthe tree in secure memory, thus allowing any given content block to beauthenticated simply by computing a hash and performing a comparison.Since the hash values are typically small in comparison with the size ofthe content blocks from which they are derived, the space consumed bythe tree will usually be relatively small. For example, if the hash of a512-byte content block is 20 bytes, and a tree is constructed for 1024content blocks (i.e., approximately 500 kilobytes of data), the amountof dynamic memory needed to store the relevant hash values would only beabout 420 bytes if the approach shown in FIGS. 12 and 13 were used, or20 kilobytes if the approach described in connection with FIG. 14 wereused (assuming a uniform branching factor of four). It will beappreciated, however, that for purposes of practicing the presentinvention other suitable balances between memory and processingrequirements could be struck.

Although the foregoing invention has been described in some detail forpurposes of clarity of understanding, it will be apparent that certainchanges and modifications may be practiced within the scope of theappended claims. It is emphasized that there are many alternative waysof implementing both the processes and apparatuses of the presentinvention. Accordingly, the present embodiments are to be consideredillustrative and not restrictive, and the invention is not to be limitedto the details given herein, but may be modified within the scope andequivalents of the appended claims.

1.-18. (canceled)
 19. A method for securely accessing a data streamcomprising: receiving a first portion of the data stream; accessing aroot verification value; accessing one or more check values in ahierarchy of check values; verifying the integrity of the one or morecheck values using, at least in part, the root verification value toidentify the one or more check values as one or more verified checkvalues; securely storing said one or more verified check values;generating a calculated check value by performing a transformation onthe first portion of the data stream; accessing a first verified checkvalue of the one or more securely stored verified check values;comparing the calculated check value with the first verified checkvalue; and determining whether the first portion of the data streamshould be released for use based at least in part on whether thecalculated check value matches the first verified check value.
 20. Themethod of claim 19, wherein the hierarchy of check values is derived, atleast in part, from an uncorrupted version of the data stream.
 21. Themethod of claim 19, wherein the root verification value is obtained bydecrypting a digital signature associated with the data stream.
 22. Themethod of claim 19, wherein the root verification value is derived, atleast in part, from the check values in the hierarchy of check values.23. The method of claim 19, wherein at least the step of verifying isperformed within a protected processing environment.
 24. The method ofclaim 19, wherein at least the step of generating is performed within aprotected processing environment.
 25. The method of claim 19, wherein atleast the step of comparing is performed within a protected processingenvironment.
 26. The method of claim 19, wherein at least the steps ofverifying, generating, and comparing are performed within a protectedprocessing environment.
 27. The method of claim 19, wherein accessingthe first verified check value comprises accessing the verified checkvalues from a tamper resistant memory unit.
 28. The method of claim 19,wherein the hierarchy of check values comprises a tree data structure.29. The method of claim 28, wherein the tree data structure issymmetric.
 30. The method of claim 29, wherein the tree data structurehas a branching factor of four.
 31. The method of claim 19, whereindetermining whether the first portion of the data should be released foruse comprises: determining that the calculated check value is not equalto the first verified check value; and inhibiting at least one use ofthe first portion of the data stream.
 32. The method of claim 31,wherein the method further comprises terminating receipt of furtherportions of the data stream.
 33. The method of claim 31, wherein themethod further comprises generating a report indicating that thecalculated check value is not equal to the first verified check value.34. The method of claim 31, wherein the method further comprisesupdating a running total of errors associated with the data stream basedon determining that the calculated check value is not equal to the firstverified check value.
 35. The method of claim 31, wherein the methodfurther comprises: comparing the updated running total of errors with athreshold; and implementing at least one defensive action based ondetermining that the updated running total of errors exceeds thethreshold.
 36. The method of claim 31, wherein the method furthercomprises updating a pattern of detected errors associated with the datastream based on determining that the calculated check value is not equalto the first verified check value.
 37. The method of claim 36, whereinthe method further comprises: identifying in the updated pattern ofdetected errors a number of errors in consecutive portions of the datastream exceeding a threshold; and implementing at least one defensiveaction based on determining that the number of errors in consecutiveportions of the data stream exceeds the threshold.
 38. The method ofclaim 36, wherein the method further comprises: identifying in theupdated pattern of detected errors that a number of errors exceeding athreshold occur in similar positions within the data stream; andimplementing at least one defensive action based on determining that thenumber of errors in consecutive portions of the data stream exceeds thethreshold.
 39. The method of claim 19, wherein determining whether thefirst portion of the data should be released for use comprises:determining that the calculated check value is equal to the firstverified check value; and releasing the first portion of data stream foruse.
 40. The method of claim 39, wherein the method further comprisesgenerating a report indicating that the calculated check value is equalto the first verified check value.